On sceptical vs credulous acceptance for abstract argument systems

نویسندگان

  • Sylvie Doutre
  • Jérôme Mengin
چکیده

At a high level of abstraction, many systems of argumentation can be represented by a set of abstract arguments, and a binary relation between these abstract arguments describing how they contradict each other. Acceptable sets of arguments, called extensions, can be defined as sets of arguments that do not contradict one another, and attack all their attackers. We are interested in this paper in answering the question: is a given argument in all extensions of an argumentation system? In fact, what is likely to be useful in AI systems is not a simple yes/no answer, but some kind of well-argued answer, called a proof: if an argument is in every extension, why is it so? We describe a close connection between this problem and proofs that some meta-argument is in at least one extension of a meta-argumentation system, describing relationships between sets of arguments of the initial system.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Testing Credulous and Sceptical Acceptance in Small-World Networks

In this paper we test how efficiently state-of-the art solvers are capable of solving credulous and sceptical argument-acceptance for lower-order extensions. As our benchmark we consider two different random graph-models to obtain random Abstract Argumentation Frameworks with small-world characteristics: Kleinberg and Watt-Strogatz. We test two reasoners, i.e., ConArg2 and dynPARTIX, on such be...

متن کامل

A ConArg-based Library for Abstract Argumentation

We present ConArgLib, a C++ library implemented to help programmers solve some of the most important problems related to extension-based Abstract Argumentation. The library is based on ConArg, which exploits Constraint Programming and, in particular, Gecode, a toolkit for developing constraint-based systems and applications. Given a semantics, such problems consist, for example, in enumerating ...

متن کامل

Complexity and Combinatorial Properties of Argument Systems

Argument Systems provide a rich abstraction within which divers concepts of reasoning, acceptability and defeasibility of arguments, etc., may be studied using a unified framework. In this note we consider combinatorial and complexity-theoretic issues arising from the view of argument systems as directed graphs. The complexity results focus on decision questions pertaining to different degrees ...

متن کامل

Combining sceptical epistemic reasoning with credulous practical reasoning

This paper proposes an argument-based semantics for combined epistemic and practical reasoning, taking seriously the idea that in certain contexts epistemic reasoning is sceptical while practical reasoning is credulous. The new semantics combines grounded and preferred semantics. A dialectical proof theory is defined which is sound and complete with respect to this semantics and which combines ...

متن کامل

Combining sceptical epistemic reasoning with credulous practical reasoning ( corrected version ) 1

This paper proposes an argument-based semantics for combined epistemic and practical reasoning, taking seriously the idea that in certain contexts epistemic reasoning is sceptical while practical reasoning is credulous. The new semantics combines grounded and preferred semantics. A dialectical proof theory is defined which is sound and complete with respect to this semantics and which combines ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004